The generalization of scheduling with machine cost
نویسندگان
چکیده
منابع مشابه
Single Machine Scheduling with Weighted Nonlinear Cost
We consider the problem of scheduling jobs on a single machine. Given a nonlinear cost function, we aim to compute a schedule minimizing the weighted total cost, where the cost of each job is defined as the cost function value at the job’s completion time. Throughout the past decades, great effort has been made to develop fast optimal branch-and-bound algorithms for the case of quadratic costs....
متن کاملScheduling with machine cost and rejection
In this paper we consider the scheduling problem with machine cost and rejection penalties. For this problem, we are given a sequence of independent jobs, each being characterized by its processing time (size) and its penalty. No machine is initially provided, and when a job is revealed the algorithm has the option to purchase new machines. Right when a new job arrives, we have the following ch...
متن کاملOnline scheduling with machine cost and rejection
In this paper we define and investigate a new scheduling model. In this new model the number of machines is not fixed; the algorithm has to purchase the used machines, moreover the jobs can be rejected. We show that the simple combinations of the algorithms used in the area of scheduling with rejections and the area of scheduling with machine cost are not constant competitive. We present a 2.61...
متن کاملGeneralization of Decomposed Integration Methods for Cost Effective Heat Exchanger Networks with Multiple Cost Laws
At many circumstances, in heat exchange processes several exchangers were used with different cost laws due to their pressure ratings, materials of construction and exchange3r types. In such circumstances traditional methods of pinch technology can not be led to minimum total annual cost may cause some other disadvantages like more complexity or higher maintenance. In this research work a n...
متن کاملStudy of Scheduling Problems with Machine Availability Constraint
In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature wil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.09.009